Volume Requirements of 3D Upward Drawings
نویسندگان
چکیده
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is achievable.
منابع مشابه
A Genetic Algorithm based Optimization Method in 3D Solid Reconstruction from 2D Multi-View Engineering Drawings
There are mainly two categories for a 3D reconstruction from 2D drawings: B-Rep and CSG that both these methods have serious weaknesses despite being useful. B-Rep method which has been older and have wider function range is problematic because of high volume of calculations and vagueness in answers and CSG method has problem in terms of very limited range of volumes and drawings that it can an...
متن کاملUpward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings with small bounding box volume. Our first main result is that every nvertex graph with bounded degeneracy has a three-dimensional grid drawing with O...
متن کاملA Note on Optimal Area Algorithms for Upward Drawings of Binary Trees
Crescenzi, P., G. Di Battista and A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry: Theory and Applications 2 (1992) 187-200. The goal of this paper is to investigate the area requirements for upward grid drawings of binary trees. First, we show that there is a family of binary trees with n vertices that require Q(n logn) area; this bound...
متن کاملArea-eecient Upward Tree Drawings
Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
متن کاملOptimum-width upward order-preserving poly-line drawings of trees
An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each vertex. Chan showed that any tree has an upward order-preserving drawing with width O(logn). In this paper, we consider upward order-preserving drawings where edges are allowed to have bends. We present a linear-time algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2005